TSTP Solution File: CSR128^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR128^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:34 EDT 2024
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 80 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 191 ( 27 ~; 23 |; 9 &; 129 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 15 !; 4 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_23,type,
lBill_THFTYPE_i: $i ).
thf(decl_24,type,
lMary_THFTYPE_i: $i ).
thf(decl_25,type,
lSue_THFTYPE_i: $i ).
thf(decl_26,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_27,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_28,type,
n2009_THFTYPE_i: $i ).
thf(ax_001,axiom,
! [X1: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CbKNHbSiWW/E---3.1_14298.p',ax_001) ).
thf(con,conjecture,
? [X2: $i,X3: $i] : ( holdsDuring_THFTYPE_IiooI @ X2 @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.CbKNHbSiWW/E---3.1_14298.p',con) ).
thf(ax,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.CbKNHbSiWW/E---3.1_14298.p',ax) ).
thf(c_0_3,axiom,
! [X1: $i] :
( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_001]) ).
thf(c_0_4,negated_conjecture,
~ ? [X2: $i,X3: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3 )
| ( holdsDuring_THFTYPE_IiooI @ X2 @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3 )
| ( holdsDuring_THFTYPE_IiooI @ X2 @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_5,plain,
! [X7: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X7 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X7 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,negated_conjecture,
! [X8: $i,X9: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X9 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X9 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X8 @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X9 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X9 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X8 @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X8 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X8 @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax]) ).
thf(c_0_8,plain,
! [X1: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X2 @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,plain,
! [X1: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(sr,[status(thm)],[c_0_13,c_0_12]) ).
thf(c_0_17,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ),
inference(sr,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR128^1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 15:03:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.CbKNHbSiWW/E---3.1_14298.p
% 0.18/0.46 # Version: 3.1.0-ho
% 0.18/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.46 # Starting sh4l with 300s (1) cores
% 0.18/0.46 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.18/0.46 # sh4l with pid 14380 completed with status 0
% 0.18/0.46 # Result found by sh4l
% 0.18/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.46 # Starting sh4l with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGHNF-FFSF11-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46 # new_ho_10 with pid 14384 completed with status 0
% 0.18/0.46 # Result found by new_ho_10
% 0.18/0.46 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.46 # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.46 # Starting sh4l with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGHNF-FFSF11-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 11
% 0.18/0.46 # Removed by relevancy pruning/SinE : 0
% 0.18/0.46 # Initial clauses : 17
% 0.18/0.46 # Removed in clause preprocessing : 9
% 0.18/0.46 # Initial clauses in saturation : 8
% 0.18/0.46 # Processed clauses : 15
% 0.18/0.46 # ...of these trivial : 0
% 0.18/0.46 # ...subsumed : 1
% 0.18/0.46 # ...remaining for further processing : 14
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 1
% 0.18/0.46 # Backward-rewritten : 1
% 0.18/0.46 # Generated clauses : 1
% 0.18/0.46 # ...of the previous two non-redundant : 1
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 1
% 0.18/0.46 # Paramodulations : 0
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 1
% 0.18/0.46 # ...of those cached : 0
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 4
% 0.18/0.46 # Positive orientable unit clauses : 1
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 3
% 0.18/0.46 # Non-unit-clauses : 0
% 0.18/0.46 # Current number of unprocessed clauses: 1
% 0.18/0.46 # ...number of literals in the above : 2
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 10
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 2
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 1
% 0.18/0.46 # Non-unit clause-clause subsumptions : 1
% 0.18/0.46 # Unit Clause-clause subsumption calls : 1
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 1
% 0.18/0.46 # BW rewrite match successes : 1
% 0.18/0.46 # Condensation attempts : 18
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 693
% 0.18/0.46 # Search garbage collected termcells : 86
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.002 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.004 s
% 0.18/0.46 # Maximum resident set size: 1752 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.002 s
% 0.18/0.46 # System time : 0.005 s
% 0.18/0.46 # Total time : 0.007 s
% 0.18/0.46 # Maximum resident set size: 1708 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------